Stochastic asymmetric Blotto games: An experimental study

Stochastic Asymmetric Blotto Games: Theory and Experimental Evidence

We consider a model where 2 players compete for  items having different common values in a Blotto game. Players have to decide how to allocate their budgets across all  items. The winner of each item is determined stochastically. We analyze two payoff objectives: (i) players aim to maximize their total expected payoff and (ii) players maximize the probability of winning a majority value of al...

Stochastic asymmetric Blotto games: Some new results

An experimental investigation of colonel blotto games

This article examines behavior in the Colonel Blotto game with asymmetric forces. In this constant-sum game, two players simultaneously allocate their forces across n-battlefields, with the objective of maximizing the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a battlefield is deterministic, th...

The Asymmetric Colonel Blotto Game

This paper explores the Nash equilibria of a variant of the Colonel Blotto game, which we call the Asymmetric Colonel Blotto game. In the Colonel Blotto game, two players simultaneously distribute forces across n battlefields. Within each battlefield, the player that allocates the higher level of force wins. The payoff of the game is the proportion of wins on the individual battlefields. In the...

Pathwise strategies for stochastic differential games with an erratum to ''Stochastic Differential Games with Asymmetric Information''

We introduce a new notion of pathwise strategies for stochastic differential games. This allows us to give a correct meaning to some statement asserted in [2].